Random MAX SAT, random MAX CUT, and their phase transitions
نویسندگان
چکیده
منابع مشابه
un 2 00 3 Random max sat , Random max cut , and Their Phase Transitions
Given a 2-sat formula F consisting of n variables and ⌊cn⌋ random clauses, what is the largest number of clauses maxF satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of 3 4 cn and cn. We prove that for c < 1, the expected number of clauses satisfiable is ⌊cn⌋ −Θ(1/n); for large c, it is ( 4 c+Θ( √ c))n; for c = 1+ε, it is at least (1+ε−O(ε3)...
متن کاملRandom Max 2-sat and Max Cut
Given a 2-SAT formula F consisting of n variables and b n random clauses, what is the largest number of clauses maxF satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of 34 n and n. We prove that for < 1, the expected number of clauses satisfiable is b n o(1); for large , it is ( 34 + (p ))n; for = 1 + ", it is at least (1 + " O("3))n and at m...
متن کاملTight Bounds For Random MAX 2-SAT
For a conjunctive normal form formula F with n variables and m = cn 2-variable clauses (c is called the density), denote by maxF is the maximum number of clauses satisfiable by a single assignment of the variables. For the uniform random formula F with density c = 1 + ε, ε À n−1/3, we prove that maxF is in (1 + ε−Θ(ε3))n with high probability. This improves the known upper bound (1 + ε − Ω(ε3/ ...
متن کاملShould Algorithms for Random SAT and Max-SAT Be Different?
We analyze to what extent the random SAT and Max-SAT problems differ in their properties. Our findings suggest that for random k-CNF with ratio in a certain range, Max-SAT can be solved by any SAT algorithm with subexponential slowdown, while for formulae with ratios greater than some constant, algorithms under the random walk framework require substantially different heuristics. In light of th...
متن کاملThe MAX-CUT of sparse random graphs
A k-cut of a graph G = (V,E) is a partition of its vertex set into k parts; the size of the k-cut is the number of edges with endpoints in distinct parts. MAX-k-CUT is the optimization problem of finding a k-cut of maximal size and the case where k = 2 (often called MAX-CUT) has attracted a lot of attention from the research community. MAX-CUT —more generally, MAX-k-CUT— is NP-hard and it appea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2004
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20015